Convergence Rate and Quasi-Optimal Complexity of Adaptive Finite Element Computations for Multiple Eigenvalues
نویسندگان
چکیده
In this paper, we study an adaptive finite element method for multiple eigenvalue problems. We obtain both convergence rate and quasi-optimal complexity of the adaptive finite element eigenvalue approximation, without any additional assumption to those required in the adaptive finite element analysis for the boundary value problem. Our analysis is based on a certain relationship between the finite element eigenvalue approximation and the associated finite element boundary value approximation and a crucial property of eigenspace approximation which are also presented in the paper.
منابع مشابه
Convergence and Optimality of Higher-Order Adaptive Finite Element Methods for Eigenvalue Clusters
Proofs of convergence of adaptive finite element methods for approximating eigenvalues and eigenfunctions of linear elliptic problems have been given in a several recent papers. A key step in establishing such results for multiple and clustered eigenvalues was provided by Dai et. al. in [8], who proved convergence and optimality of AFEM for eigenvalues of multiplicity greater than one. There it...
متن کاملConvergence and Quasi-optimal Complexity of a Simple Adaptive Finite Element Method
We prove convergence and quasi-optimal complexity of an adaptive finite element algorithm on triangular meshes with standard mesh refinement. Our algorithm is based on an adaptive marking strategy. In each iteration, a simple edge estimator is compared to an oscillation term and the marking of cells for refinement is done according to the dominant contribution only. In addition, we introduce an...
متن کاملAdaptive Unstructured Grid Generation Scheme for Solution of the Heat Equation
An adaptive unstructured grid generation scheme is introduced to use finite volume (FV) and finite element (FE) formulation to solve the heat equation with singular boundary conditions. Regular grids could not acheive accurate solution to this problem. The grid generation scheme uses an optimal time complexity frontal method for the automatic generation and delaunay triangulation of the grid po...
متن کاملError Reduction, Convergence and Optimality for Adaptive Mixed Finite Element Methods for Diffusion Equations
Error reduction, convergence and optimality are analyzed for adaptive mixed finite element methods (AMFEM) for diffusion equations without marking the oscillation of data. Firstly, the quasi-error, i.e. the sum of the stress variable error and the scaled error estimator, is shown to reduce with a fixed factor between two successive adaptive loops, up to an oscillation. Secondly, the convergence...
متن کاملAdaptive Finite Element Algorithms for the Stokes Problem: Convergence Rates and Optimal Computational Complexity
Although adaptive finite element methods (FEMs) are recognized as powerful techniques for solving mixed variational problems of fluid mechanics, usually they are not even proven to converge. Only recently, in [SINUM, 40 (2002), pp.1207-1229] Bänsch, Morin and Nochetto introduced an adaptive Uzawa FEM for solving the Stokes problem, and showed its convergence. In their paper, numerical experimen...
متن کامل